A Chebyshev minimax technique oriented to aerospace trajectory optimization problems.
نویسندگان
چکیده
منابع مشابه
Algebraic solutions to multidimensional minimax location problems with Chebyshev distance
Multidimensional minimax single facility location problems with Chebyshev distance are examined within the framework of idempotent algebra. A new algebraic solution based on an extremal property of the eigenvalues of irreducible matrices is given. The solution reduces both unconstrained and constrained location problems to evaluation of the eigenvalue and eigenvectors of an appropriate matrix. ...
متن کاملA Genetic Algorithm for Minimax Optimization Problems
Robust discrete optimization is a technique for structuring uncertainty in the decision-making process. The objective is to find a robust solution that has the best worst-case performance over a set of possible scenarios. However, this is a difficult optimization problem. This paper proposes a two-space genetic algorithm as a general technique to solve minimax optimization problems. This algori...
متن کاملA New Algebraic Solution to Multidimensional Minimax Location Problems with Chebyshev Distance
Both unconstrained and constrained minimax single facility location problems are considered in multidimensional space with Chebyshev distance. A new solution approach is proposed within the framework of idempotent algebra to reduce the problems to solving linear vector equations and minimizing functionals defined on some idempotent semimodule. The approach offers a solution in a closed form tha...
متن کاملA novel hybrid meta-heuristic technique applied to the well-known benchmark optimization problems
In this paper, a hybrid meta-heuristic algorithm, based on imperialistic competition algorithm (ICA), harmony search (HS), and simulated annealing (SA) is presented. The body of the proposed hybrid algorithm is based on ICA. The proposed hybrid algorithm inherits the advantages of the process of harmony creation in HS algorithm to improve the exploitation phase of the ICA algorithm. In addition...
متن کاملParticle Swarm Optimization for Minimax Problems
This paper investigates the ability of the Particle Swarm Optimization (PSO) method to cope with minimax problems through experiments on well{known test functions. Experimental results indicate that PSO tackles minimax problems e ectively. Moreover, PSO alleviates di culties that might be encountered by gradient{based methods, due to the nature of the minimax objective function, and potentially...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AIAA Journal
سال: 1972
ISSN: 0001-1452,1533-385X
DOI: 10.2514/3.6604